Topology Aware Gossip Overlays
نویسندگان
چکیده
Gossip, or epidemic, protocols have emerged as a highly scalable and resilient approach to implement several application level services such as reliable multicast, data aggregation, publish-subscribe, among others. All these protocols organize nodes in an unstructured random overlay network. In many cases, it is interesting to bias the random overlay such that it better matches the underlying network topology, for instance to reduce the stretch in the overlay routing. In this paper we propose a new scheme that allows an unstructured gossip overlay network to bias its topology accordingly to some efficiency metric, for instance to better match the topology of the underlying network. Our scheme is completely decentralized and, unlike previous approaches, preserves a number of interesting properties of the original (non-biased) overlay, such as the node degree, small diameter, and low clustering.
منابع مشابه
Topology-aware Gossip Dissemination for Large-scale Datacenters
Gossip-based protocols are very robust and are able to distribute the load uniformly among all processes. Furthermore, gossip-protocols circumvent the oscillatory phenomena that are known to occur with other forms of reliable multicast. As a result, they are excellent candidates to support the dissemination of information in large-scale datacenters. However, in this context, topology oblivious ...
متن کاملA peer-to-peer recommender system for self-emerging user communities based on gossip overlays
Gossip-based Peer-to-Peer protocols proved to be very efficient for supporting dynamic and complex information exchange among distributed peers. They are useful for building and maintaining the network topology itself as well as to support a pervasive diffusion of the information injected into the network. This is very useful in a world where there is a growing need to access and be aware of ma...
متن کاملGenius: Peer-to-Peer Location-Aware Gossip Using Network Coordinates
The gossip mechanism could support reliable and scalable communication in large-scale settings. In large-scale peer-to-peer environment, however, each node could only have partial knowledge of the group membership. More seriously, because the node has no global knowledge about the underlying topology, gossip mechanism incurs much unnecessary network overhead on the Internet. In this paper, we p...
متن کاملGossip Communities: Collaborative Filtering Through Peer-to-Peer Overlays (Extended Abstract)
Gossip-based Peer-to-Peer protocols proved to be very efficient for supporting dynamic and complex information exchange among distributed peers. They are useful for building and maintaining the network topology itself as well as to support a pervasive diffusion of the information injected into the network. In this paper, we propose the general architecture of a system that tries to exploit the ...
متن کاملA popularity-based query scheme in P2P networks using adaptive gossip sampling
As P2P networks, such as many forms of social networking have been rapidly growing, numerous efforts have been made to improve the efficiency of the search operation especially in terms of response time and hit ratio. To this end, popularity-based schemes have recently attracted attention aimed at increasing search efficiency using content popularity ranking; however, these methods suffer from ...
متن کامل